NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
191	Selecting a Comprehensive Set of Reviews Panayiotis Tsaparas Alexandros Ntoulas∗ Evimaria Terzi† Add to Reading List Source URL: www.cs.uoi.gr Language: English - Date: 2011-11-03 14:00:49 Data mining NP-complete problems Submodular set function Greedy algorithm Algorithm Automatic summarization XTR Set cover problem
192	IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. 5, NO. 2, Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2008-04-10 08:31:28 NP-complete problems NP Set cover problem Vertex cover Thorn Approximation algorithm
193	Graphs and Homomorphisms Our contribution Finding vertex-surjective graph homomorphisms Petr Golovach, Bernard Lidick´y, Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2012-07-03 09:45:04 Morphisms Graph theory NP-complete problems Graph isomorphism Core Graph homomorphism Homomorphism Duality Subgraph isomorphism problem Group theory
194	CS369N: Beyond Worst-Case Analysis Lecture #4: Probabilistic and Semirandom Models for Clustering and Graph Partitioning∗ Tim Roughgarden† April 25, 2010 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2011-09-26 19:00:24 NP-complete problems Planted clique Clique problem Clique Graph partition Maximum cut Probability distribution
195	Economics and Computation ECONand CPSCProfessor Dirk Bergemann and Professor Joan Feigenbaum Lecture IV Add to Reading List Source URL: zoo.cs.yale.edu Language: English - Date: 2008-10-07 04:07:53 Complexity classes Computational complexity theory Boolean algebra Structural complexity theory NP-complete problems Boolean satisfiability problem NP PP Reduction True quantified Boolean formula Exponential time hypothesis P
196	Distributed Computing manuscript No. (will be inserted by the editor) Distributed Minimum Dominating Set Approximations in Restricted Families of Graphs Christoph Lenzen · Yvonne-Anne Pignolet · Roger Wattenhofer Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:12 NP-complete problems Maximal independent set Treewidth Arboricity Dominating set Planar graph Independent set Matching Graph minor Bipartite graph Line graph Planar separator theorem
197	Fast Distributed Network Decompositions and Covers Baruch Awerbuch y Bonnie Berger z David Peleg { Add to Reading List Source URL: www.cs.tufts.edu Language: English - Date: 2012-10-31 09:54:24 NP-complete problems Graph coloring Matroid theory Graph connectivity Ear decomposition Neighbourhood Degeneracy Maximal independent set Independent set Bridge Graph theory Treewidth
198	CS261: A Second Course in Algorithms Lecture #15: Introduction to Approximation Algorithms∗ Tim Roughgarden† February 23, 2016 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-02-28 14:26:27 NP-complete problems Knapsack problem Set cover problem Steiner tree problem Vertex cover Approximation algorithm Greedy algorithm Dynamic programming Minimum spanning tree Algorithm Time complexity NP
199	Combining Constraint Programming, Lagrangian Relaxation and Probabilistic Algorithms to solve the Vehicle Routing Problem Daniel Guimarans1 , Rosa Herrero1 , Daniel Riera2 , Angel A. Juan2 , and Juan Jos´e Ramos1 1 Add to Reading List Source URL: ceur-ws.org Language: English - Date: 2010-05-18 03:15:30 Operations research Mathematical optimization Search algorithms NP-complete problems Combinatorial optimization Variable neighborhood search Vehicle routing problem Travelling salesman problem Heuristic A* search algorithm Lagrangian relaxation Local search
200	Parameterized Complexity of the Weighted Independent Set Problem beyond Graphs of Bounded Clique Number∗† Konrad Dabrowski1 , Vadim Lozin1‡, Haiko M¨ uller2 , and Dieter Rautenbach3 1 Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2012-04-30 01:44:46 NP-complete problems Chordal graph Bipartite graph Clique problem Interval graph Claw-free graph Clique Graph minor Perfect graph Split graph Independent set Graph

UPDATE